On Data Allocation with the Minimum Overall Communication Costs in Distributed Database Design

نویسندگان

  • Xuemin Lin
  • Maria E. Orlowska
  • Yanchun Zhang
چکیده

This paper investigates the problem of allocation of database fragments to a network, so that the overall communication cost for processing a given set of transactions is minimized. Presented first is a data allocation algorithm with respect to a "simple strategy" to process transactions. Secondly, we present a dynamic data allocation algorithm which is guaranteed to produce a "locally optimal" data allocation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Separating indexes from data: a distributed scheme for secure database outsourcing

Database outsourcing is an idea to eliminate the burden of database management from organizations. Since data is a critical asset of organizations, preserving its privacy from outside adversary and untrusted server should be warranted. In this paper, we present a distributed scheme based on storing shares of data on different servers and separating indexes from data on a distinct server. Shamir...

متن کامل

An Iterative Method for Distributed Database Design

The development of a distributed database system requires effective solutions to many complex and interrelated design problems. The cost dependencies between query optimization and data allocation on distrihuled systems are well recognized but little understood. We investigate these dependencies by proposing and analyzing an iterative heuristic which provides an integrated solution lo the query...

متن کامل

Fragment Allocation in Distributed Database Design

On a Wide Area Network (WAN), fragment allocation is a major issue in distributed database design since it concerns the overall performance of distributed database systems. Here we propose a simple and comprehensive model that reflects transaction behavior in distributed databases. Based on the model and transaction information, two heuristic algorithms are developed to find a near-optimal allo...

متن کامل

Vertical Class Fragmentation in a Distributed Object Based System

Processing costs in distributed processing environments is most often dominated by the network communications required for interprocess communication. It is well-known from the distributed relational database design research that careful placement of data \near" the users or processors where it is used is mandatory or system performance will suuer greatly. Data placement in relational database ...

متن کامل

Allocation of Databases in a Distributed Database System

Our research focuses on developing a methodology for designing distributed database systems. This methodology is used to allocate databases across a number of computer sites connected by a communication network. It takes into account the pattern of usage of the databases, the communication costs in the network, delays due to queuing of requests for data, costs for maintaining consistency among ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993